Incremental evaluation for attribute grammars with unrestricted movement between tree modifications

Incremental Evaluation of Ordered Attribute Grammars for Asynchronous Subtree Replacements

Incremental algorithms for evaluating attribute grammars (AGs) have been extensively studied in recent years, primarily because of their application in language-based environments. Ordered attribute grammars are a subclass of AGs for which efficient evaluators can be constructed. Previous incremental algorithms for ordered attribute grammars only allowed one modification 10 the program at a tim...

Incremental Evaluators for Remote Attribute Grammars

Remote attribute grammars use objects with separately defined fields to induce direct nonlocal dependencies in attribute grammars. Fields of an object may be read remotely from where it is created, and special “collection” fields may be written remotely as well. Building on earlier work which shows that remote attribute grammars can be scheduled statically, this paper shows how they may be impl...

Efficient Incremental Evaluation of Higher order Attribute Grammars

Incremental Parser Generation for Tree Adjoining Grammars

This paper describes the incremental generation of parse tables for the LRtype parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modi cations to the input grammar by updating the parser generated so far. In this paper, a lazy generation of LR-type parsers for TALs is de ned in which parse tables are created by need while parsing. We then describe an incremental parser ...

Functional Incremental Attribute Evaluation

This paper presents a new strict, purely functional implementation of attribute grammars. Incremental evaluation is obtained via standard function memoization. Our new implementation of attribute grammars increases the incremental behaviour of the evaluators by both reducing the memoization overhead and increasing their potential incrementallity. We present also an attribute grammar transformat...